Hardness of fully dense problems
نویسندگان
چکیده
منابع مشابه
Hardness of fully dense problems
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpinski from 1995 and that of Frieze and Kannan from 1996. We address the problem of proving hardness results for (fully) dense problems, which has been neglected despite the fruitful effort put in upper bounds. In this wor...
متن کاملOn Approximation Hardness of Dense TSP and other Path Problems
TSP(1,2) is the problem of nding a tour with minimum length in a complete weighted graph where each edge has length 1 or 2. Let d o satisfy 0 < d o < 1=2. We show that TSP(1,2) has no PTAS on the set of instances where the density of the subgraph spanned by the edges with length 1 is bounded below by d o. We also show that LONGEST PATH has no PTAS on the set of instances with density bounded be...
متن کاملHardness of Facility Location Problems
1.2 Hardness of k-median Theorem 1. It is hard to approximate k-median within 1+ 2 e1/c for any c < 1. This theorem is equivalent to the 1− 1/e− hardness shown in [2] and follows from a standard reduction from set cover. The main idea is to take an approximation algorithm for k-median, and use it to obtain a partial set cover. Then repeat this process, again partially covering the remaining ite...
متن کاملHardness of edge-modification problems
For a graph property P consider the following computational problem. Given an input graph G, what is the minimum number of edge modifications (additions and/or deletions) that one has to apply to G in order to turn it into a graph that satisfies P? Namely, what is the edit distance ∆(G,P) of a graph G from satisfying P. Clearly, the computational complexity of such a problem strongly depends on...
متن کاملConditional Hardness for Sensitivity Problems
In recent years it has become popular to study dynamic problems in a sensitivity setting: Instead of allowing for an arbitrary sequence of updates, the sensitivity model only allows to apply batch updates of small size to the original input data. The sensitivity model is particularly appealing since recent strong conditional lower bounds ruled out fast algorithms for many dynamic problems, such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2007
ISSN: 0890-5401
DOI: 10.1016/j.ic.2007.02.006